$F$-factors in graphs with randomness conditions

Abstract: The celebrated Hajnal-Szemerédi Theorem is a cornerstone in extremal graph theory and has many applications and extensions. We will focus on a class of extensions where the host graph enjoys mild randomness conditions (e.g., does not have large independent set, or contains a small amount of random edges) and discuss some recent problems and developments.

combinatorics

Audience: researchers in the topic

Comments: password 121323

SCMS Combinatorics Seminar

Series comments: Check scmscomb.github.io/ for more information